Simultaneous Interval Graphs
نویسندگان
چکیده
In a recent paper, we introduced the simultaneous representation problem (defined for any graph class C) and studied the problem for chordal, comparability and permutation graphs. For interval graphs, the problem is defined as follows. Two interval graphs G1 and G2, sharing some vertices I (and the corresponding induced edges), are said to be “simultaneous interval graphs” if there exist interval representations R1 and R2 of G1 and G2, such that any vertex of I is mapped to the same interval in both R1 and R2. Equivalently, G1 and G2 are simultaneous interval graphs if there exist edges E ′ between G1 − I and G2 − I such that G1 ∪G2 ∪ E is an interval graph. Simultaneous representation problems are related to simultaneous planar embeddings, and have applications in any situation where it is desirable to consistently represent two related graphs, for example: interval graphs capturing overlaps of DNA fragments of two similar organisms; or graphs connected in time, where one is an updated version of the other. In this paper we give an O(nlogn) time algorithm for recognizing simultaneous interval graphs, where n = |G1 ∪ G2|. This result complements the polynomial time algorithms for recognizing probe interval graphs and provides an efficient algorithm for the interval graph sandwich problem for the special case where the set of optional edges induce a complete bipartite graph.
منابع مشابه
Tenacity and some other Parameters of Interval Graphs can be computed in polynomial time
In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...
متن کاملThe Simultaneous Membership Problem for Chordal, Comparability and Permutation graphs
In this paper we introduce the simultaneous membership problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two graphs G1 and G2, sharing some vertices X (and the corresponding induced edges), are said to be simultaneous members of graph class C, if there exist representations R1 and R2 of G1 and G2 that are “consistent” on X ....
متن کاملThe Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
We introduce a notion of simultaneity for any class of graphs with an intersection representation (interval graphs, chordal graphs, etc.) and for comparability graphs, which are represented by transitive orientations. Let G1 and G2 be graphs from such a class C, sharing some vertices I and the corresponding induced edges. Then G1 and G2 are said to be simultaneous C graphs if there exist repres...
متن کاملThe robust vertex centdian location problem with interval vertex weights on general graphs
In this paper, the robust vertex centdian location problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max regret criterion. This problem is investigated with objective function contains $lambda$ and a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...
متن کاملComparing Pairwise and Simultaneous Joint Registrations of Decorrelating Interval Exams Using Entropic Graphs
The interest in registering a set of images has quickly risen in the field of medical image analysis. Mutual information (MI) based methods are well-established for pairwise registration but their extension to higher dimensions (multiple images) has encountered practical implementation difficulties. We extend the use of alpha mutual information (alphaMI) as the similarity measure to simultaneou...
متن کامل